node n. 1.節(jié);結(jié);瘤;【蟲類】結(jié)脈。 2.【植物;植物學(xué)】莖節(jié);【醫(yī)學(xué)】硬結(jié)腫;結(jié),節(jié)結(jié);【天文學(xué)】交點。 3.【數(shù)學(xué)】結(jié)點,交軌點;叉點;【物理學(xué)】節(jié);波節(jié)〔振動體的靜止點〕;中心點。 4.(情節(jié)的)曲折,錯綜復(fù)雜。 a current node 電流波節(jié)。
Gets or sets the number of routing nodes that can forward the 數(shù)據(jù)之前可以轉(zhuǎn)發(fā)該數(shù)據(jù)的路由節(jié)點數(shù)。
The packet or packet fragments can be forwarded by routing nodes 128 times before being discarded 數(shù)據(jù)包或數(shù)據(jù)包片段在丟棄之前,可通過路由節(jié)點轉(zhuǎn)發(fā)128次。
The packet or packet fragments if fragmented can be forwarded by routing nodes 128 times before being discarded 數(shù)據(jù)包或數(shù)據(jù)包片段(如果數(shù)據(jù)包被分段)在被丟棄之前,可由路由節(jié)點轉(zhuǎn)發(fā)128次。
Fourthly, we propose a load balance policy of ospf parellel implementation for balancing the loades between the routing nodes 提出了ospf并行實現(xiàn)的負荷均衡策略,用于平衡路由計算各節(jié)點的負荷。
The performance analysis showes the speedup comparing this method with controlized processing is n to n2, and n is the sum of routing node 對其性能分析表明,該算法相對于集中式處理方法的加速比在n到n~2之間。
So the routing node computing routing table does n't exist the things with too heavy load in the long term because of routing computation 該策略確保進行路由計算的節(jié)點不至于因進行路由計算而長時間地處于高負荷狀態(tài)。
And the total packet size exceeds the maximum packet size that can be transmitted by one of the routing nodes between the local and remote computers, the icmp echo request fails ,而數(shù)據(jù)包總大小超過本地計算機和遠程計算機間某一路由節(jié)點可傳輸?shù)淖畲髷?shù)據(jù)包大小時,icmp回送請求會失敗。
Also we design a link state database storage scheme of distributed storage and redundance backup which ease the implementation of the routing table computation in routing node and synchronization between neighbor routers 同時對域內(nèi)鏈路狀態(tài)數(shù)據(jù)庫采用了分布式存儲、冗余備份的方案,易于實現(xiàn)各節(jié)點上的路由表計算及路由器間的同步。
The packet that contains the icmp echo message can be fragmented in transit if the total packet size exceeds the maximum packet size that can be transmitted by one of the routing nodes between the local and remote computers 如果包含icmp回送消息的數(shù)據(jù)包總大小超過了本地計算機和遠程計算機間某一路由節(jié)點可傳輸?shù)淖畲髷?shù)據(jù)包大小,則該數(shù)據(jù)包會分成若干段進行傳輸。
In order to avoid too heavy load of the routing node computing routing table in some circumstance, we use a maneuver of load balance between the routing nodes computing routing table and nodes not computing routing table 為防止并行路由表計算中少數(shù)情況下可能出現(xiàn)的路由計算節(jié)點負荷過重,該策略對各個計算節(jié)點及非計算節(jié)點進行輪詢式查詢,若計算節(jié)點的負荷過重,則使能非計算節(jié)點。